A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues
نویسندگان
چکیده
We compare the overall mean response time (a.k.a. sojourn time) of the processor sharing (PS) and feedback (FB) queues under an M/GI/1 system. We show that FB outperforms PS under service distributions having decreasing failure rates; whereas PS outperforms FB under service distributions having increasing failure rates. c © 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Competitive Analysis of M/GI/1 Queueing Policies
We propose a framework for comparing the performance of two queueing policies. Our framework is motivated by the notion of competitive analysis, widely used by the computer science community to analyze the performance of online algorithms. We apply our framework to compare M/GI/1/FB and M/GI/1/SJF with M/GI/1/SRPT, and obtain new results about the performance of M/GI/1/FB and M/GI/1/SJF. Carneg...
متن کاملA Suality Relation for Busy Cycles in GI/G/1 Queues
Using a generalization of the classical ballot theorem, Niu and Cooper [7] established a duality relation between the joint distribution of several variables associated with the busy cycle in M/G/1 (with a modified first service) and the corresponding joint distribution of several related variables in its dual GI/M/1. In this note, we generalize this duality relation to GI/G/1 queues with modif...
متن کاملA sample path relation for the sojourn times in G/G/1-PS systems and its applications
For the general G/G/1 processor sharing (PS) system a sample path result for the sojourn times in a busy period is proved, which yields a relation between the sojourn times under PS and FCFS discipline. In particular, the result provides a formula for the mean sojourn time in G/D/1-PS in terms of the mean sojourn time in the corresponding G/D/1-FCFS, generalizing known results for GI/M/1 and M/...
متن کاملOn the Waiting Time in the GI/M/1 Vacations Queues with Dependency Between Interarrival and Service Times
We derive the waiting time distribution in a GI/M/1 queueing system with dependence between the service time of each customer and the subsequent interarrival times. In addition, the server takes exponentially distributed vacations when there are no customers left to serve in the queue.
متن کاملSimulating Tail Probabilities in GI/GI.1 Queues and Insurance Risk Processes with Sub Exponential Distributions
This paper deals with estimating small tail probabilities of the steady-state waiting time in a GI/GI/1 queue with heavy-tailed (subexponential) service times. The interarrival times can have any distribution with a nite mean. The problem of estimating in nite horizon ruin probabilities in insurance risk processes with heavy-tailed claims can be transformed into the same framework. It is well-k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 32 شماره
صفحات -
تاریخ انتشار 2004